Levenshtein transition table
| CANDIDATES | открива otkriva BLG 🇧🇬 | otkriva otkriva CRO 🇭🇷 | odkrywa odkryva POL 🇵🇱 | razkriva razkriva SLN 🇸🇮 | открива otkriva SRB 🇷🇸 | відкриває, vidkryvaje, UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
| otkriva | 0 | 0 ÷ 2 | 1.5 | 3 | 0 ÷ 2 | 6.5 | 11.0 | 0.0 |
| odkryva | 1.5 | 1.5 ÷ 2 | 0 | 3.5 | 1.5 ÷ 2 | 5 | 11.5 | -0.5 |
| razkriva | 3 | 3 ÷ 2 | 3.5 | 0 | 3 ÷ 2 | 6.5 | 16.0 | -5.0 |
| vidkryvaje, | 6.5 | 6.5 ÷ 2 | 5 | 6.5 | 6.5 ÷ 2 | 0 | 24.5 | -13.5 |
1TOTAL LEVENSHTEIN DISTANCE - Summarized count of letter replacements, insertions or deletions to convert the word into national words. The lower the better.
2MUTUAL INTELLIGIBILITY LOSS - Distance to the best candidate word (the best word has always 0.0 score).
Dictionary Index • Levenshtein Distance • Pravopis • Home
slovanto.eu